Reliability Weighted Voting Games
نویسندگان
چکیده
We examine agent failures in weighted voting games. In our cooperative game model, R-WVG, each agent has a weight and a survival probability, and the value of an agent coalition is the probability that its surviving members would have a total weight exceeding a threshold. We propose algorithms for computing the value of a coalition, finding stable payoff allocations, and estimating the power of agents. We provide simulation results showing that on average the stability level of a game increases as the failure probabilities of the agents increase. This conforms to several recent results showing that failures increase stability in cooperative games.
منابع مشابه
Combinatorial and computational aspects of multiple weighted voting games
Weighted voting games are ubiquitous mathematical models which are used in economics, political science, neuroscience, threshold logic, reliability theory and distributed systems. They model situations where agents with variable voting weight vote in favour of or against a decision. A coalition of agents is winning if and only if the sum of weights of the coalition exceeds or equals a specified...
متن کاملComputing voting power in easy weighted voting games
Weighted voting games are ubiquitous mathematical models which are used in economics, political science, neuroscience, threshold logic, reliability theory and distributed systems. They model situations where agents with variable voting weight vote in favour of or against a decision. A coalition of agents is winning if and only if the sum of weights of the coalition exceeds or equals a specified...
متن کاملComplexity of some aspects of control and manipulation in weighted voting games
An important aspect of mechanism design in social choice protocols and multiagent systems is to discourage insincere behaviour. Manipulative behaviour has received increased attention since the famous Gibbard-Satterthwaite theorem. We examine the computational complexity of manipulation in weighted voting games which are ubiquitous mathematical models used in economics, political science, neuro...
متن کاملClassification Of Computationally Tractable Weighted Voting Games
Weighted voting games are ubiquitous mathematical models which are used in economics, political science, neuroscience, threshold logic, reliability theory and distributed systems. They model situations where agents with variable voting weight vote in favour of or against a decision. A coalition of agents is winning if and only if the sum of weights of the coalition exceeds or equals a specified...
متن کاملA Complete Geometric Representation of Four-Player Weighted Voting Systems
The relatively new weighted voting theory applies to many important organizations such as the United States Electoral College and the International Monetary Fund. Various power indexes are used to establish a relationship between weights and influence; in 1965, the Banzhaf Power Index was used to show that areas of Nassau County were unrepresented in the county legislature. It is of interest to...
متن کاملOn the Dimensionality of Voting Games
In a yes/no voting game, a set of voters must determine whether to accept or reject a given alternative. Weighted voting games are a well-studied subclass of yes/no voting games, in which each voter has a weight, and an alternative is accepted if the total weight of its supporters exceeds a certain threshold. Weighted voting games are naturally extended to k-vector weighted voting games, which ...
متن کامل